Skewness-aware Clustering Social Recommender

نویسنده

  • Chaofei Fan
چکیده

Recommender systems have been a hot research area recently. One of the most widely used methods is Collaborative Filtering(CF), which selects items for an individual user from other similar users. However, CF may not fully reflect the procedure of how people choose an item in real life, for users are more likely to ask friends for opinions instead of asking strangers with similar interests. Recently, some recommendation methods based on social network have been proposed. These approaches assume that data follow Gaussian distribution, and then incorporate social network into the CF algorithms. Therefore, users preferences can be influenced by the flavors of their friends. In this paper, we propose the Skewness-aware Clustering Social Recommender. Our contributions are three-fold: (1) we show that data do not follow Gaussian distribution and then correct the bias and skewness of ratings; (2) we propose the social cluster model based on cluster coefficient; (3) our improvement outperforms the baseline by 3.34%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Merging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems

In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...

متن کامل

Evolutionary User Clustering Based on Time-Aware Interest Changes in the Recommender System

The plenty of data on the Internet has created problems for users and has caused confusion in finding the proper information. Also, users' tastes and preferences change over time. Recommender systems can help users find useful information. Due to changing interests, systems must be able to evolve. In order to solve this problem, users are clustered that determine the most desirable users, it pa...

متن کامل

The Impact of Situation Clustering in Contextual-Bandit Algorithm for Context-Aware Recommender Systems

Most existing approaches in Context-Aware Recommender Systems (CRS) focus on recommending relevant items to users taking into account contextual information, such as time, location, or social aspects. However, few of them have considered the problem of user’s content dynamicity. We introduce in this paper an algorithm that tackles the user’s content dynamicity by modeling the CRS as a contextua...

متن کامل

Improving the performance of recommender systems in the face of the cold start problem by analyzing user behavior on social network

The goal of recommender system is to provide desired items for users. One of the main challenges affecting the performance of recommendation systems is the cold-start problem that is occurred as a result of lack of information about a user/item. In this article, first we will present an approach, uses social streams such as Twitter to create a behavioral profile, then user profiles are clusteri...

متن کامل

Context-Aware Recommender Systems: A Review of the Structure Research

 Recommender systems are a branch of retrieval systems and information matching, which through identifying the interests and requires of the user, help the users achieve the desired information or service through a massive selection of choices. In recent years, the recommender systems apply describing information in the terms of the user, such as location, time, and task, in order to produce re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011